منابع مشابه
Limit Theorems for Markets with Sequential Bargaining*
This paper models trade as a non-coopertative, strategic game played at an inlinite sequence of dates. A single, indivisible commodity is traded. Buyers and sellers have transferable utility and are characterized by their reservation utilities. They meet at random and “bargain” over the price at which a single unit of the good will be exchanged. Under a variety of circumstances it is shown that...
متن کاملLimit theorems for some adaptive MCMC algorithms with subgeometric kernels
Abstract. This paper deals with the ergodicity (convergence of the marginals) and the law of large numbers for adaptive MCMC algorithms built from transition kernels that are not necessarily geometrically ergodic. We develop a number of results that broaden significantly the class of adaptive MCMC algorithms for which rigorous analysis is now possible. As an example, we give a detailed analysis...
متن کاملLimit theorems for weighted samples with applications to Sequential Monte Carlo Methods
In the last decade, sequential Monte-Carlo methods (SMC) emerged as a key tool in computational statistics (see for instance Doucet et al. (2001), Liu (2001), Künsch (2001)). These algorithms approximate a sequence of distributions by a sequence of weighted empirical measures associated to a weighted population of particles. These particles and weights are generated recursively according to ele...
متن کاملLimit Theorems for Some Adaptive Mcmc Algorithms with Subgeometric Kernels: Part Ii
We prove a central limit theorem for a general class of adaptive Markov Chain Monte Carlo algorithms driven by sub-geometrically ergodic Markov kernels. We discuss in detail the special case of stochastic approximation. We use the result to analyze the asymptotic behavior of an adaptive version of the Metropolis Adjusted Langevin algorithm with a heavy tailed target density.
متن کاملLimit theorems for mergesort
Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard top-down recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms and standard analytic methods in probability theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2020
ISSN: 0001-8678,1475-6064
DOI: 10.1017/apr.2020.9